Locally helical surfaces have bounded twisting
نویسندگان
چکیده
منابع مشابه
Helical twisting power and scaled chiral indices
Chirality of optically active liquid crystal molecules has become an important research topic and the subject of a number of theoretical and experimental studies. We present here the results of the application of a newly developed scaling method of a chiral index to a range of chiral molecules. Good agreement is found between the scaled chiral index and the helical twisting power for relatively...
متن کاملLocally polynomially bounded structures
We prove a theorem which provides a method for constructing points on varieties defined by certain smooth functions. We require that the functions are definable in a definably complete expansion of a real closed field and are locally definable in a fixed o-minimal and polynomially bounded reduct. As an application we show that in certain o-minimal structures definable functions are piecewise im...
متن کاملCalculating the helical twisting power of chiral dopants{
This paper describes a Monte Carlo simulation technique designed to predict the sign and magnitude of the helical twisting power, bM, of a chiral material. The method calculates the chemical potential difference, Dm, between a chiral dopant and its enantiomer when they are placed in a twisted nematic solvent. In the low concentration limit, Dm is directly proportional to bM. In the simulations ...
متن کاملCalculations of helical twisting powers from intermolecular torques.
We present a Monte Carlo molecular simulation method that calculates the helical twisting power of a chiral molecule by sampling intermolecular torques. The approach is applied to an achiral nematic liquid crystalline system, composed of Gay-Berne particles, that is doped with chiral molecules. Calculations are presented for six chiral dopant molecules and the results show a good correlation wi...
متن کاملCluster editing with locally bounded modifications
Given an undirected graph G = (V,E) and a nonnegative integer k, the NPhard Cluster Editing problem asks whether G can be transformed into a disjoint union of cliques by modifying at most k edges. In this work, we study how “local degree bounds” influence the complexity of Cluster Editing and of the related Cluster Deletion problem which allows only edge deletions. We show that even for graphs ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 2018
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.2018.292.257